On an Improvement of a Result by Niederreiter and Wang Concerning the Expected Linear Complexity of Multisequences
نویسنده
چکیده
We show that the expected value for the joint linear complexity of an m–multisequence of length n is E n = ⌈
منابع مشابه
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....
متن کاملThe expected value of the joint linear complexity of periodic multisequences
Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a wellknown relationship between the linear complexity of an N -periodic sequence ...
متن کاملMultisequences with high joint nonlinear complexity
We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on the behavior of the joint nonlinear complexity of random multisequences over a fixed finite field.
متن کاملTowards a General Theory of Simultaneous Diophantine Approximation of Formal Power Series: Multidimensional Linear Complexity
We model the development of the linear complexity of multisequences by a stochastic infinite state machine, the Battery–Discharge– Model, BDM. The states s ∈ S of the BDM have asymptotic probabilities or mass μ∞(s) = P(q,M) −1 ·q−K(s), whereK(s) ∈ N0 is the class of the state s, and P(q,M) = ∑ K∈N0 PM (K)q −K = ∏M i=1 q i/(qi − 1) is the generating function of the number of partitions into at m...
متن کاملGeneralized Joint Linear Complexity of Linear Recurring Multisequences
The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each Nperiodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996